/*
day204
2020.3.19
*/
#include<iostream>
#include<vector>
using namespace std;

class Solution {
public:
    void merge(vector<int>& A, int m, vector<int>& B, int n) {
		int point=m+n-1;
		int pa=m-1,pb=n-1;
		while(pa>=0 && pb>=0)
		{
			if(A[pa]>B[pb])
			{
				A[point]=A[pa];
				pa--;
			}
			else 
			{
				A[point]=B[pb];
				pb--;
			} 
			point--;
		}
		
		while(pa>=0)
		{
			A[point]=A[pa];
			pa--;
			point--;
		}
		
		while(pb>=0)
		{
			A[point]=B[pb];
			pb--;
			point--;
		}
    }
};

int main()
{
	return 0;
}
